Search for: All records

Kinematic synthesis to meet an approximate motion specification naturally forms a constrained optimization problem. Instead of using local methods, we conduct global design searches by direct computation of all critical points. The idea is not new, but performed at scale is only possible through modern polynomial homotopy continuation solvers. Such a complete computation finds all minima, including the global, which allows for a full exploration of the design space, whereas local solvers can only find the minimum nearest to an initial guess. We form equality-constrained objective functions that pertain to the synthesis of spherical four-bar linkages for approximate function generation. We consider the general case where all mechanism dimensions may vary and a more specific case that enables the placement of ground pivots. The former optimization problem is shown to permit 268 sets of critical points, and the latter permits 61 sets. Critical points are classified as saddles or minima through a post-process eigenanalysis of the projected Hessian. The discretization points are contained within the coefficients of the stationarity polynomials, so the algebraic structure of the synthesis equations remains invariant to the number of points. The results of our computational work were used to design a mechanism that coordinates the folding wings. We also use this method to parameterize mechanism dimensions for a family of hyperbolic curves. 

An algorithm is presented for computing the tension in an elastic cable subject to sagging under its own weight, a problem highly relevant in tethered systems such as cable-driven parallel robots. This requires solving the two coupled equations of the Irvine cable model, which give the endpoint position as a function of vertical and horizontal components of tension. Via a change of variables, we reformulate this system as a pair of uncoupled equations, which are shown to have a unique solution. We develop an efficient numerical procedure to solve one of these, after which closed-form formulas provide the solution of the second equation and ultimately the tension components. 

Designing and analyzing large cable-driven parallel robots (CDPRs) for precision tasks can be challenging, as the position kinematics are governed by kineto-statics and cable sag equations. Our aim is to find all equilibria for a given set of unstrained cable lengths using numerical continuation techniques. The Irvine sagging cable model contains both non-algebraic and multi-valued functions. The former removes the guarantee of finiteness on the number of isolated solutions, making homotopy start system construction less clear. The latter introduces branch cuts, which could lead to failures during path tracking. We reformulate the Irvine model to eliminate multi-valued functions and propose a heuristic numerical continuation method based on monodromy, removing the reliance on a start system. We demonstrate this method on an eight-cable spatial CDPR, resulting in a well-constrained non-algebraic system with 31 equations. The method is applied to four examples from literature that were previously solved in bounded regions. Our method computes the previously reported solutions along with new solutions outside those bounds much faster, showing that this numerical method enhances existing approaches for comprehensively analyzing CDPR kineto-statics. 

The approximate path synthesis of four-bar linkages with symmetric coupler curves is presented. This includes the formulation of a polynomial optimization problem, a characterization of the maximum number of critical points, a complete numerical solution by homotopy continuation, and application to the design of straight line generators. Our approach specifies a desired curve and finds several optimal four-bar linkages with a coupler trace that approximates it. The objective posed simultaneously enforces kinematic accuracy, loop closure, and leads to polynomial first order necessary conditions with a structure that remains the same for any desired trace leading to a generalized result. Ground pivot locations are set as chosen parameters, and it is shown that the objective has a maximum of 73 critical points. The theoretical work is applied to the design of straight line paths. Parameter homotopy runs are executed for 1440 different choices of ground pivots for a thorough exploration. These computations found the expected linkages, namely, Watt, Evans, Roberts, Chebyshev, and other previously unreported linkages which are organized into a 2D atlas using the UMAP algorithm. 

Abstract Kinematic synthesis to meet an approximate motion specification naturally forms a constrained optimization problem. In this work, we conduct global design searches by direct computation of all critical points through stationarity conditions. The idea is not new, but performed at scale is only possible through modern polynomial homotopy continuation solvers. Such a complete computation finds all minima, including the global, serving as a powerful design exploration technique. We form equality constrained objective functions that pertain to the synthesis of spherical four-bar linkages for approximate function generation. For each problem considered, Lagrangian stationarity conditions set up a square system of polynomials. We consider the most general case where all mechanism dimensions may vary, and a more specific case that enables the placement of ground pivots. The former optimization problem is shown to permit an estimated maximum of 268 sets of critical points, and the latter permits 61 sets. Critical points are classified as saddles or minima through a post-process eigenanalysis of the projected Hessian. Approximate motion is specified as discretized points from a desired input-output angle function. The coefficients of the stationarity polynomials can be expressed as summations of symmetric matrices indexed by the discretization points. We take the sums themselves to parameterize these polynomials rather than constituent terms (the discrete data). In this way, the algebraic structure of the synthesis equations remains invariant to the number of discretization points chosen. The results of our computational work were used to design a mechanism that coordinates the unfolding of wings for a deployable aircraft.